An Incomplete Method for Solving Distributed Valued Constraint Satisfaction Problems
نویسنده
چکیده
This paper sets a model for Distributed Valued Constraint Satisfaction Problems, and proposes an incompletemethod for solving such problems. This method is a greedy repair distributed algorithm which extends to the distributed case any greedy repair centralized algorithm. Experiments are carried out on a real-world problem and show the practical interest of this method.
منابع مشابه
Agent Cooperation Can Compensate For Agent Ignorance in Constraint Satisfaction
A team of constraint agents with diverse viewpoints can find a solution to a constraint satisfaction problem (CSP) when the individual agents have an incomplete view of the problem. In this paper we present a method of solving constraint satisfaction problems (CSPs) using cooperating constraint agents where each agent has a different representation of a particular CSP. Agents assist one another...
متن کاملScheduling Meetings Using Distributed Valued Constraint Satisfaction Algorithm
Scheduling meetings is generally difficult in that it attempts to satisfy the preferences of all participants. However, all participants can agree to a schedule in which a portion of their preferences are not satisfied, since preferences are regarded in terms of their relative importance. In this paper, we formalize a meeting scheduling as a Distributed Valued Constraint Satisfaction Problem (D...
متن کاملA New Method for Solving Constraint Satisfaction Problems
Many important problems in Artificial Intelligence can be defined as Constraint Satisfaction Problems (CSP). These types of problems are defined by a limited set of variables, each having a limited domain and a number of Constraints on the values of those variables (these problems are also called Consistent Labeling Problems (CLP), in which “Labeling means assigning a value to a variable.) Solu...
متن کاملA New Method for Solving Constraint Satisfaction Problems
Many important problems in Artificial Intelligence can be defined as Constraint Satisfaction Problems (CSP). These types of problems are defined by a limited set of variables, each having a limited domain and a number of Constraints on the values of those variables (these problems are also called Consistent Labeling Problems (CLP), in which “Labeling" means assigning a value to a variable.) Sol...
متن کاملCSAA: A Distributed Ant Algorithm Framework for Constraint Satisfaction
In this paper the distributed Constraint Satisfaction Ant Algorithm (CSAA) framework is presented. It uses an ant-based system for the distributed solving of constraint satisfaction problems (CSPs) and partial constraint satisfaction problems (PCSPs). Altough ant algorithms have already proven to be a viable alternative to classical approaches for a variety of optimization and combinatorial pro...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1997